Sampling, conditionalizing, counting, merging, searching regular vines
نویسندگان
چکیده
منابع مشابه
Sampling, conditionalizing, counting, merging, searching regular vines
We present a sampling algorithm for a regular vine on n variables which starts at an arbitrary variable. A sampling order whose nested conditional probabilities can be written as products of (conditional) copulas in the vine and univariate margins is said to be implied by the regular vine. We show that there are 2 implied sampling orders for any regular vine on n variables. We show that two reg...
متن کاملIncorporating Regular Vines in Estimation of Distribution Algorithms
This chapter presents the incorporation and use of regular vines into Estimation of Distribution Algorithms for solving numerical optimization problems. Several kinds of statistical dependencies among continuous variables can be taken into account by using regular vines. This work presents a procedure for selecting the most important dependencies in EDAs by truncating regular vines. Moreover, t...
متن کاملStructure learning in Bayesian Networks using regular vines
Learning the structure of a Bayesian Network from multidimensional data is an important task in many situations, as it allows understanding conditional (in)dependence relations which in turn can be used for prediction. Current methods mostly assume a multivariate normal or a discrete multinomial model. A new greedy learning algorithm for continuous non-Gaussian variables, where marginal distrib...
متن کاملPropagating Regular Counting Constraints
Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling. This led to general modelling techniques and generic propagators, often based on deterministic finite automata (DFA) and their extensions. We consider counter-DFAs (cDFA), which provide concise models for regular counting constraints, that is constraints over the number of times a regular-language patte...
متن کاملConditionalizing on Knowledge
A theory of evidential probability is developed from two assumptions: (1) the evidential probability of a proposition is its probability conditional on the total evidence; (2) one's total evidence is one's total knowledge. Evidential probability is distinguished from both subjective and objective probability. Loss as well as gain of evidence is permitted. Evidential probability is embedded with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2015
ISSN: 0047-259X
DOI: 10.1016/j.jmva.2015.02.001